A “joint + marginal” heuristic for 0/1 programs
نویسندگان
چکیده
منابع مشابه
A "joint+marginal" algorithm for polynomial optimization
We present a new algorithm for solving a polynomial program P based on the recent ”joint + marginal” approach of the first author for parametric polynomial optimization. The idea is to first consider the variable x1 as a parameter and solve the associated (n−1)-variable (x2, . . . , xn) problem P(x1) where the parameter x1 is fixed and takes values in some interval Y1 ⊂ R, with some probability...
متن کاملHeuristic Model Checking for Java Programs
Two recent areas of interest in software model checking are checking programs written in standard programming languages [1, 5] and using heuristics to guide the exploration of an explicit-state model checker [3]. Model checking real programs has the drawback that programs often contain a larger degree of detail than designs and hence are more difficult to check (due to the more acute stateexplo...
متن کاملOctane: A New Heuristic for Pure 0-1 Programs
We propose a new heuristic for pure 0–1 programs, which finds feasible integer points by enumerating extended facets of the octahedron, the outer polar of the unit hypercube. We give efficient algorithms to carry out the enumeration, and we explain how our heuristic can be embedded in a branch-and-cut framework. Finally, we present computational results on a set of pure 0–1 programs taken from ...
متن کاملA heuristic method to schedule training programs for SMEs
During the life period of Small and Medium Enterprises (SMEs) in incubators they need some training programs to acquire the required knowledge in order to survive and succeed in the business environment. This paper presents a heuristic method based on an optimization model to schedule these programs at the most suitable times. Based on the proposed heuristic, each training program is implemente...
متن کاملProximity Benders: a decomposition heuristic for stochastic programs
is eventually found and the method terminates. As convergence may require a large amount of computing time for hard instances, the method unsatisfactory from a heuristic point of view. Proximity Search is a recently-proposed heuristic paradigm in which the problem at hand is modified and iteratively solved with the aim of producing a sequence of improving feasible solutions. As such, Proximity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2011
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-011-9788-9